Dynamic RePacking: A Content Replication Policy for Clustered Multimedia Servers

نویسنده

  • Jeremy Jones
چکیده

Dynamic replication is a technique that can be used by clustered multimedia servers to evaluate the demand for individual streams and selectively replicate or move content to facilitate load balancing. In this paper we explain the motivation for using dynamic replication and provide a brief description of some existing dynamic replication policies. We present a new policy called Dynamic RePacking. This policy is based on the existing MMPacking algorithm [11], but has been modified to handle nodes and files with varying bandwidth and storage characteristics and to reduce the cost of adapting to changes in client demand or server configuration. Simulation results show that Dynamic RePacking performs better than both the original MMPacking algorithm and the threshold-based scheme which we have simulated for comparison. Our results also show that Dynamic RePacking performs significantly less movement and replication of files than the original MMPacking algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Replication of Content in the Hammerhead Multimedia Server

In a clustered multimedia server, by periodically evaluating client demand for each file and performing selective replication of those files with the highest demand, the files can be distributed among server nodes to achieve load balancing. This technique is referred to as dynamic replication. Several dynamic replication policies have been proposed in the past, but to our knowledge, our work is...

متن کامل

On-Demand Multimedia Server Clustering Using Dynamic Content Replication

This thesis examines the provision of on-demand multimedia streaming services using clusters of commodity PCs. In the proposed HammerHead multimedia server cluster architecture, a dynamic content replication policy is used to assign non-disjoint subsets of the presentations in a multimedia archive to cluster nodes. Replicas of selected presentations can be created on more than one node to achie...

متن کامل

Optimal Content Replication and Request Matching in Large Caching Systems

We consider models of content delivery networks in which the servers are constrained by two main resources: memory and bandwidth. In such systems, the throughput crucially depends on how contents are replicated across servers and how the requests of specific contents are matched to servers storing those contents. In this paper, we first formulate the problem of computing the optimal replication...

متن کامل

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

Replicating the Contents of a WWW Multimedia Repository to Minimize Download Time

Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as to improve object proximity for the end-users and/ or load-balance the servers. Most of the existing algorithms try to disseminate the objects of an entire Internet Service Provider (ISP), without taking into account t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002